Approximation of the Riesz–Caputo Derivative by Cubic Splines
نویسندگان
چکیده
Differential problems with the Riesz derivative in space are widely used to model anomalous diffusion. Although Riesz–Caputo is more suitable for modeling real phenomena, there few examples literature where numerical methods solve such differential problems. In this paper, we propose approximate of a given function cubic spline. As far as aware, first time that splines have been context derivative. To show effectiveness proposed method, present tests which compare analytical solution several boundary obtain by spline collocation method. The results method efficient and accurate.
منابع مشابه
Approximation of digitized curves with cubic Bézier splines
In this paper we examine a problem of digitized curves approximation for raster graphics vectorization and develop an efficient implementation of a near-optimal Dynamic Programming algorithm for digitized curves approximation with cubic Bézier splines for a given distortion bound. For better fitting performance, we introduce the inflection points with relaxed constraint of tangent continuity. T...
متن کاملApproximation by Conic Splines
We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ε is c1ε +O(1), if the spline consists of parabolic arcs, and c2ε + O(1), if it is composed of general conic arcs of varying type. The constants c1 and c2 are expressed in the Euclidean and affine curvature of the curve. We also show that...
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملApproximation by Cubic Splines Leads to Highly Specific Discovery by Microarrays
Genome-scale microarray datasets are noisy. We have previously reported an algorithm that yields highly specific genome-scale discovery of states of genetic expression. In its original implementation, the algorithm computes parameters by globally fitting data to a function containing a linear combination of elements that are similar to the Hill equation and the Michaelis-Menten differential equ...
متن کاملThe Degree of Approximation by Chebyshevian Splines
This papet studies the connections between the smoothness of a function and its degree of approximation by Chebyshevian splines. This is accomplished by proving companion direct and inverse theorems which give a characterization of smoothness in terms of degree of approximation. A determination of the saturation properties is included.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2022
ISSN: ['1999-4893']
DOI: https://doi.org/10.3390/a15020069